منابع مشابه
Dualities in full homomorphisms
In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edgeand non-edge-preserving. The research was motivated, a.o., by results from logic (concerning first order definability) and Constraint Satisfaction Problems. We prove that for any finite set of objects B (finite relational structures) there...
متن کاملFinite Dualities, in Particular in Full Homomorphisms
This paper is a survey of several results concerning finite dualities, a special case of the famous Constraint Satisfaction Problem (CSP). In CSP, the point is to characterize a class C of objects X determined by constraints represented by the requirement of the existence of structure preserving mappings from X into special ones. In a finite duality, such a class C is characterized by the non-e...
متن کاملDualities in population genetics: a fresh look with new dualities
We apply our general method of duality, introduced in [10], to models of population dynamics. The classical dualities between forward and ancestral processes can be viewed as a change of representation in the classical creation and annihilation operators, both for diffusions dual to coalescents of Kingman’s type, as well as for models with finite population size. Next, using SU(1, 1) raising an...
متن کاملNatural Dualities in Partnership
Traditionally in natural duality theory the algebras carry no topology and the objects on the dual side are structured Boolean spaces. Given a duality, one may ask when the topology can be swapped to the other side to yield a partner duality (or, better, a dual equivalence) between a category of topological algebras and a category of structures. A prototype for this procedure is provided by the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.04.004